A computationally efficient symmetric diagonally dominant matrix projection-based Gaussian process approach
نویسندگان
چکیده
Although kernel approximation methods have been widely applied to mitigate the O(n3) cost of n×n matrix inverse in Gaussian process methods, they still face computational challenges. The ‘residual’ between covariance and approximating component is often discarded as it prevents reduction. In this paper, we propose a computationally efficient approach that achieves better efficiency, O(mn2), compared with standard when using m≪n data. proposed incorporates its symmetric diagonally dominant form which can be further approximated by Neumann series. We validated full approaches based variants, both on synthetic real air quality
منابع مشابه
Computationally Efficient Gaussian Process
Most existing GP regression algorithms assume a single generative model, leading to poor performance when data are nonstationary, i.e. generated from multiple switching processes. Existing methods for GP regression over non-stationary data include clustering and changepoint detection algorithms. However, these methods require significant computation, do not come with provable guarantees on corr...
متن کاملSolving Symmetric Diagonally-Dominant Systems by Preconditioning
In this paper we design support-tree preconditioners for n × n matrices with m nonzeros that aresymmetric and diagonally-dominant with a nonnegative diagonal (SDD matrix). This reduces to de-signing such a preconditioner for a Laplacian matrix, A, which can be interpreted as an undirectednonnegatively-weighted graph, G with n vertices and m edges. Preconditioners accelerate the ...
متن کاملMatrices Diagonally Similar to a Symmetric Matrix
Let IF be field, and let A and B be n X n matrices with elements in IF. Suppose that A is completely reducible and that B is symmetric. If the principal minors of A determined by the 1and 2-circuits of the graph of B and by the chordless circuits of the graph of A are equal to the corresponding principal minors of B, then A is diagonally similar to B; and conversely.
متن کاملGaussian elimination is stable for the inverse of a diagonally dominant matrix
Let B ∈Mn(C) be a row diagonally dominant matrix, i.e., σi|bii| = n ∑ j=1 j 6=i |bij |, i = 1, . . . , n, where 0 ≤ σi < 1, i = 1, . . . , n, with σ = max1≤i≤n σi. We show that no pivoting is necessary when Gaussian elimination is applied to A = B−1. Moreover, the growth factor for A does not exceed 1 + σ. The same results are true with row diagonal dominance being replaced by column diagonal d...
متن کاملA Fast Distributed Solver for Symmetric Diagonally Dominant Linear Equations
In this paper, we propose a fast distributed solver for linear equations given by symmetric diagonally dominant M-Matrices. Our approach is based on a distributed implementation of the parallel solver of Spielman and Peng by considering a specific approximated inverse chain which can be computed efficiently in a distributed fashion. Representing the system of equations by a graph G, the propose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2021
ISSN: ['0165-1684', '1872-7557']
DOI: https://doi.org/10.1016/j.sigpro.2021.108034